Fixed Channel Assignment Optimization for Cellular Mobile Networks
نویسندگان
چکیده
The optimization of channel assignment in cellular mobile networks is an NP-complete combinatorial optimization problem. For any reasonable size network, only sub-optimal solutions can be obtained by heuristic algorithms. In this paper, six channel assignment heuristic algorithms are proposed and evaluated. They are the combinations of three channel assignment strategies and two cell ordering methods. What we found are (i) the node-color ordering of cells is a more efficient ordering method than the node-degree ordering; (ii) the frequency exhaustive strategy is more suitable for systems with highly non-uniformly distributed traffic, and the requirement ex-
منابع مشابه
Fixed channel assignment algorithm for multi-radio multi-channel MESH networks
Recently, multi-radio mesh technology in wireless networks has been under extensive research. This is because of its potential of overcoming the inherent wireless multi-hop throughput, scalability and latency problems caused by the half-duplex nature of the IEEE 802.11. The concept of deploying multiple radios in wireless network access points (APs) has shown a promising way to enhance the chan...
متن کاملA Decomposition Technique for Fixed Channel Assignment Problems in Cellular Mobile Radio Networks
The Fixed Channel Assignment (FCA) problem is of major importance in the design of cellular mobile radio networks, and belongs to the class of NP-complete optimisation problems. The known exact solutions to FCA problems are strictly limited by the size of the problem to be solved. In this paper, a new powerful solution approach to the FCA problem is proposed. The underlying principle of the pro...
متن کاملPower Control and Scheduling For Low SNR Region in the Uplink of Two Cell Networks
In this paper we investigate the sub-channel assignment and power control to maximize the total sum rate in the uplink of two-cell network. It is assumed that there are some sub-channels in each cell which should be allocated among some users. Also, each user is subjected to a power constraint. The underlying problem is a non-convex mixed integer non-linear optimization problem which does not h...
متن کاملTransiently Chaotic Neural Networks for Channel Assignment in Cellular Mobile Communications
Recently, Chen and Aihara proposed the transiently chaotic neural network (TCNN) for solving combinatorial optimization problems, and the TCNN has shown a high solving ability for traveling salesman problem (TSP). In this paper, we are interested in the channel assignment problem (CAP) which is to assign the required number of frequency channels to each cell in a cellular mobile network in such...
متن کاملA Two-Threshold Guard Channel Scheme for Minimizing Blocking Probability in Communication Networks
In this paper, we consider the call admission problem in cellular network with two classes of voice users. In the first part of paper, we introduce a two-threshold guard channel policy and study its limiting behavior under the stationary traffic. Then we give an algorithm for finding the optimal number of guard channels. In the second part of this paper, we give an algorithm, which minimizes th...
متن کامل